Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem
نویسندگان
چکیده
منابع مشابه
A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints
The quay crane scheduling problem (QCSP) determines the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the vessel’s service time is minimized. A number of heuristics or metaheuristics have been proposed to obtain the near-optimal solutions to overcome the NP-hardness of the problem. In this article, the idea of generalized extremal optimizati...
متن کاملAn ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for Surgery Scheduling Problem
Considering the complete process of surgery including the preoperative and postoperative stages, multiple resource constraints involved and the integration of surgical upstream and downstream resources, surgery scheduling was described as an extended multi-resource constrained flexible job-shop scheduling problem and an optimization approach was proposed based on an improved ant colony algorith...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2019
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2018.2.002